The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems

نویسندگان

  • Zvi Drezner
  • Atsuo Suzuki
چکیده

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. INFORMS is collaborating with JSTOR to digitize, preserve and extend access to Operations Research. In this paper we propose to modify the big square small square global optimization search in the plane with a big triangle small triangle approach. The triangulation of the feasible region is obtained by using Voronoi diagrams. The resulting algorithm was tested on the obnoxious facility location and the attraction-repulsion Weber problems with excellent results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Constrained Two-facility Location Problems

A general approach to optimally solve multiple facility location problems based on the “Big Triangle Small Triangle” approach to solving single facility problems is proposed. The proposed procedure is especially effective when the solution is constrained to a given polygon such as the convex hull of demand points. The procedure is tested on the two facilities Weber problem with attraction and r...

متن کامل

Solving the ordered one-median problem in the plane

In this paper we propose a general approach solution method for the single facility ordered median problem in the plane. All types of weights (non-negative, non-positive, and mixed) are considered. The big triangle small triangle approach is used for the solution. Rigorous and heuristic algorithms are proposed and extensively tested on eight different problems with excellent results.

متن کامل

A General Global Optimization Approach for Solving Location Problems in the Plane

We propose a general approach for constructing bounds required for the “Big Triangle Small Triangle” method for the solution of planar location problems. Optimization problems which constitute a sum of individual functions, each a function of the Euclidean distance to a demand point, are analyzed and solved. These bounds are based on expressing each of the individual functions in the sum as a d...

متن کامل

Evaluation of Bi-objective Scheduling Problems by FDH, Distance and Triangle Methods

In this paper, two methods named distance and triangle methods are extended to evaluate the quality of approximation of the Pareto set from solving bi-objective problems. In order to use evaluation methods, a bi-objective problem is needed to define. It is considered the problem of scheduling jobs in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimi...

متن کامل

Evaluation of Bi-objective Scheduling Problems by FDH, Distance and Triangle Methods

In this paper, two methods named distance and triangle methods are extended to evaluate the quality of approximation of the Pareto set from solving bi-objective problems. In order to use evaluation methods, a bi-objective problem is needed to define. It is considered the problem of scheduling jobs in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Operations Research

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2004